Extension to Even Triangulations

نویسندگان

  • Atsuhiro Nakamoto
  • Kenta Noguchi
  • Kenta Ozeki
چکیده

Extension of a graph G is to construct a new graph with certain properties by adding edges to some pairs of vertices in G. In this paper, we focus on extension of a quadrangulation of a surface to even triangulations, where a quadrangulation is a map on a surface with every face quadrangular and a triangulation is even if all the vertices have even degree. Zhang and He [SIAM J. Comput. 34 (2005) 683–696] gave a formula for the exact number of distinct even triangulations extended from a given plane quadrangulation, and a lower bound of the number for the case of orientable non-spherical surfaces. They also posed the problem of finding the exact number for the latter case. In this paper, using topological methods, we improve the results by Zhang and He in the following directions: (I) Extension of quadrangulations of a non-orientable surface and (II) Complete enumeration of even triangulations extended from a given quadrangulation of a non-spherical surface. Indeed, we completely solve the problem by Zhang and He.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Edge proximity and matching extension in planar triangulations

Let G be a graph with at least 2(m+ n+1) vertices. Then G is E(m,n) if for each pair of disjoint matchings M,N ⊆ E(G) of size m and n respectively, there exists a perfect matching F in G such that M ⊆ F and F ∩N = ∅. In the present paper we wish to study property E(m,n) for the various values of integers m and n when the graphs in question are restricted to be planar. It is known that no planar...

متن کامل

N-flips in even triangulations on the sphere

A triangulation is said to be even if each vertex has even degree. For even triangulations, define the N -flip and the P2-flip as two deformations preserving the number of vertices. We shall prove that any two even triangulations on the sphere with the same number of vertices can be transformed into each other by a sequence of N and P2-flips.

متن کامل

Multi-directed animals, connected heaps of dimers and Lorentzian triangulations

Bousquet-Mélou and Rechnitzer have introduced the class of multi-directed animals, as an extension of the classical 2D directed animals. They gave an explicit expression for their generating function. In the case of directed animals, the corresponding generating function is algebraic and various “combinatorial explanations” (bijective proofs) have been given, in particular using the so-called m...

متن کامل

Four-coloring Six-regular Graphs on the Torus

A classic 3-color theorem attributed to Heawood [10, 11] (also observed by Kempe [16]) states that every even triangulation of the plane is 3-chromatic; by even we mean that every vertex has even degree. We are interested in the extent to which an analogous theorem carries over to even triangulations of the torus and to other surfaces of larger genus. In general, even triangulations of the toru...

متن کامل

5-Chromatic even triangulations on surfaces

A triangulation is said to be even if each vertex has even degree. It is known that every even triangulation on any orientable surface with sufficiently large representativity is 4-colorable [J. Hutchinson, B. Richter, P. Seymour, Colouring Eulerian triangulations, J. Combin. Theory, Ser. B 84 (2002) 225–239], but all graphs on any surface with large representativity are 5-colorable [C. Thomass...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Discrete Math.

دوره 29  شماره 

صفحات  -

تاریخ انتشار 2015